#include<iostream>
#include<set>
#include<vector>
#include<algorithm>
using namespace std;


int main()
{
	int t = 0; cin >> t;
	vector<int>ret;
	while (t--)
	{
		int x; cin >> x;
		if (x % 2 != 0)ret.push_back(x);
	}
	sort(ret.begin(), ret.end());
	for (int i = 0; i < ret.size(); i++)
	{
		cout << ret[i];
		if (i != ret.size() - 1)cout << ",";
	}
	return 0;
}
